Modified Ant Colony Optimization for Solving Traveling Salesman Problem

This paper presents a new algorithm for solving the Traveling Salesman Problem (NPhard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of real-world problems can be formalized as TSP problems, and ants of the colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP and improves ACO by taking under consideration the overall path of cities in candidate list. Sometimes choosing minimum distance isn't a guaranty that’s a best path. The experimental results on large set of samples indicate that the new approach is better than the original one for finding optimal solutions of the (TSP) in less time as compared to results achieved by applying basic idea of ACO algorithm.